On partitions into nonparallel Hamming codes
نویسنده
چکیده
Let F denote the finite field with two elements. We describe a construction of partitions of F , for n = 2 − 1, m ≥ 4, into cosets of pairwise distinct Hamming codes (we call such codes nonparallel) of length n. We give a lower bound for the number of different such partitions.
منابع مشابه
Embedding in q-ary 1-perfect codes and partitions
We prove that every 1-error-correcting code over a finite field can be embedded in a 1-perfect code of some larger length. Embedding in this context means that the original code is a subcode of the resulting 1-perfect code and can be obtained from it by repeated shortening. Further, we generalize the results to partitions: every partition of the Hamming space into 1-error-correcting codes can b...
متن کاملA partition of the hypercube into maximally nonparallel Hamming codes
By use of the Gold map, we construct a partition of the hypercube into cosets of Hamming codes that have minimal possible pairwise intersection cardinality. Let m ≥ 3 be odd and let F be the finite field GF(2) of order 2. Let σ be a power of 2, and assume that σ± 1 and 2− 1 are relatively prime (that is, both x → x and x → x are one-to-one mappings), which is, by simple arguments, equivalent to...
متن کاملOn the extention of propelinear structures of Nordstrom-Robinson code to Hamming code
A code is called propelinear if its automorphism group contains a subgroup that acts regularly on its codewords, which is called a propelinear structure on the code. In the paper a classification of the propelinear structures on the Nordstrom-Robinson code is obtained and the question of extension of these structures to propelinear structures of the Hamming code, that contains the Nordstrom-Rob...
متن کاملComputation of Minimum Hamming Weight for Linear Codes
In this paper, we consider the minimum Hamming weight for linear codes over special finite quasi-Frobenius rings. Furthermore, we obtain minimal free $R$-submodules of a finite quasi-Frobenius ring $R$ which contain a linear code and derive the relation between their minimum Hamming weights. Finally, we suggest an algorithm that computes this weight using the Grobner basis and we show that und...
متن کاملTrellis-Coded Quadrature Amplitude Modulation with 2N-Dimensional Constellations for Mobile Radio Channels
– Using a modified Wei method, originally designed for AWGN channels, we have constructed fourand six-dimensional trellis codes with rectangular signal constellations for frequency-nonselective mobile radio channels. Applying a novel way of partitioning the 2-D constituent constellations, both into subsets with enlarged minimum Euclidean distance and subrings including equal energy signal point...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009